The Erdős webgraph server
نویسندگان
چکیده
منابع مشابه
Nonderogatory Directed Webgraph
Let G be a digraph with vertices labelled {1, 2, . . . , n} and its adjacency matrix A(G) the n × n matrix whose ijth entry is the number of arcs joining vertex i to vertex j. A digraph is nonderogatory if the characteristic polynomial and minimal polynomial of its adjacency matrix are equal. Computation of the minimal polynomial of a matrix is harder than the characteristic polynomial especial...
متن کاملModeling the Webgraph Evolution with Graph Grammars
The webgraph is the graph generated from the link structure of the web pages. In this graph, each node represents a web page and each edge is a hyperlink from one page to another. The webgraph has a particular structure, that is not similar to other known graphs, and it grows continuously. Nowadays it contains more then 25 billion nodes and about 400 billion edges. Even some properties of this ...
متن کاملExploring Webgraph Compression with SUBDUE
Storing a copy of the world wide web is beyond the capability of most organizations. However, it is often the case that when we are using the web, we are interested only in some particular subset of the information it contains. If we could capture only the information we are genuinely interested in, it might be feasible to store a copy of the web. Of course, different uses of the web call for d...
متن کاملLarge scale properties of the Webgraph
In this paper we present an experimental study of the properties of web graphs. We study a large crawl from 2001 of 200M pages and about 1.4 billion edges made available by the WebBase project at Stanford [17]. We report our experimental findings on the topological properties of such graphs, such as the number of bipartite cores and the distribution of degree, PageRank values and strongly conne...
متن کاملAlgorithms and Experiments for the Webgraph
In this paper we present an experimental study of the statistical and topological properties of the Webgraph. This work has required the development of a set of external and semi-external algorithms for computing properties of massive graphs, and for the large scale simulation of stochastic graph models. We use these algorithms for running experiments on a large crawl from 2001 of 200M pages an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2014
ISSN: 0166-218X
DOI: 10.1016/j.dam.2013.10.032